DNA computing: implementation of data flow logical operations
نویسندگان
چکیده
Self-assembly of DNA is considered a fundamental operation in realization of molecular logic circuits. We propose a new approach to implementation of data flow logical operations based on manipulating DNA strands. In our method the logic gates, input, and output signals are represented by DNA molecules. Each logical operation is carried out as soon as the operands are ready. This technique employs standard operations of genetic engineering including radioactive labeling as well as digestion by the second class restriction nuclease and polymerase chain reaction (PCR). To check practical utility of the method a series of genetic engineering experiments have been performed. The obtained information confirms interesting properties of the DNA-based molecular data flow logic gates. Some experimental results demonstrating implementation of a single logic NAND gate and only in one vessel calculation of a tree-like Boolean function with the help of the PCR are provided. These techniques may be utilized in massively parallel computers and on DNA chips. © 2001 Elsevier Science B.V. All rights reserved.
منابع مشابه
Implementation of Data Flow Logical Operation via Self-Assembly of DNA
Self-assembly of DNA is considered a fundamental operation in realization of molecular logic circuits. We propose a new approach to implementation of data flow logical operations based on manipulating DNA strands. In our method the logic gates, input, and output signals are represented by DNA molecules. Each logical operation is carried out as soon as the operands are ready. This technique empl...
متن کاملAutotuning a Random Walk Boolean Satisfiability Solver
In this paper we present a performance optimization case study for a kernel with dynamic data structures, few instructions on boolean variables per node, and data-dependent control flow. This kernel serves as model for wide class of important algorithms operating on dynamic data structures. Our example is a simple random walk search algorithm to solve boolean satisfiability (SAT) and our goal i...
متن کاملExperiments in Computing Sequences of Reversals
This paper discusses a bit-vector implementation of an algorithm that computes an optimal sequence of reversals that sorts a signed permutation. The main characteristics of the implementation are its simplicity , both in terms of data structures and operations, and the fact that it exploits the parallelism of bit-wise logical operations.
متن کاملAn Innovative Approach towards Arithmetic & Control in DNA Paradigm
This paper aims to conceptually evolve a DNA processor modeling its computational ability and control aspects. DNA Encoding transforms the Radix 2 numbers to strings defined over the language set S {A,T,C,G}. A-Adenine, T-Thymine, C-Cytosine, GGuanine are the nucleotides forming the DNA language set. Arithmetic and logical operations are the basis for any implementation of a computing machine. ...
متن کاملExperimental implementation of encoded logical qubit operations in a perfect quantum error correcting code.
Large-scale universal quantum computing requires the implementation of quantum error correction (QEC). While the implementation of QEC has already been demonstrated for quantum memories, reliable quantum computing requires also the application of nontrivial logical gate operations to the encoded qubits. Here, we present examples of such operations by implementing, in addition to the identity op...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Future Generation Comp. Syst.
دوره 17 شماره
صفحات -
تاریخ انتشار 2001